Secure Communications in OFDMA networks with active eavesdropper
نویسنده
چکیده
In this paper, we formulate the resource allocation problem for secure communications in a single cell OFDMA network where a base station wants to communicate to the users which are spread over its coverage area while an adversary is present in the network. In our model, we assume that the adversary s an active attacker which is able to either eavesdrop on the information transmitted over the wireless link or jam the connection by sending an interference signal but is not able to both eavesdrop and jam at the same time. The attacker's aim is to choose between eavesdropping and jamming a subcarrier such that the secrecy rate over that subcarrier is minimized. Knowing this strategy, users should consider the minimum of secrecy data rate in both cases as their achievable secrecy rate over each subcarrier. We formulate our proposed resource allocation problem into an optimization problem whose objective is to maximize the total secrecy rate of all users over all subcarriers while it is required that the total transmit power of base station remains below a predefined threshold. To solve the proposed optimization problem, we use the dual Lagrange approach. Using simulations, we study the behavior and the efficiency of the proposed scheme.
منابع مشابه
Cooperation for Secrecy in Wireless Networks
The growth of wireless networks has been considerable over the last decades. Due to the broadcast nature of these networks, security issues have taken a critical role in today’s communications. A promising direction towards achieving secure communications is information theoretic secrecy, which is an approach exploiting the randomness of the channels to ensure secrecy. Based on this approach, t...
متن کاملMitigating Node Capture Attack in Random Key Distribution Schemes through Key Deletion
Random Key Distribution (RKD) schemes have been widely accepted to enable low-cost secure communications in Wireless Sensor Networks (WSNs). However, efficiency of secure link establishment comes with the risk of compromised communications between benign nodes by adversaries who physically capture sensor nodes. The challenge is to enhance resilience of WSN against node capture, while maintainin...
متن کاملSecure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes
We analyze the security for network code when the eavesdropper can contaminate the information on the attacked edges (active attack) and can choose the attacked edges adaptively (adaptive attack). We show that active and adaptive attacks cannot improve the performance of the eavesdropper when the code is linear. Further, we give an non-linear example, in which an adaptive attack improves the pe...
متن کاملSecure Communications for Two-Way Relay Networks Via Relay Chatting
In this paper, we investigate a two-way relay network consisting of two sources, multiple cooperative relays and an eavesdropper. To enhance secure communications, a new relay chatting based on transmission scheme is proposed. Specifically, the proposed scheme selects a best relay that maximize the sum mutual information among the sources to forward the sources’ signals using an amplify-and-for...
متن کاملSecure Communication in Stochastic Wireless Networks
Information-theoretic security – widely accepted as the strictest notion of security – relies on channel coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of digital communications systems. Motivated by recent developments in the field, this paper aims at a characterization of the fundamental secrecy limits of wireless ne...
متن کامل